Schur Multipliers of Finite Simple Groups of Lie Type

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Schur Multipliers of the Known Finite Simple Groups

In this note, we announce some results about the Schur multipliers of the known finite simple groups. Proofs will appear elsewhere. We shall conclude with a summary of current knowledge on the subject. Basic properties of multipliers and covering groups of finite groups are discussed in [6]. Notation for groups of Lie type is standard [3], [8]. G' denotes the commutator subgroup of the group G,...

متن کامل

Characterization of finite $p$-groups by the order of their Schur multipliers ($t(G)=7$)

‎Let $G$ be a finite $p$-group of order $p^n$ and‎ ‎$|{mathcal M}(G)|=p^{frac{1}{2}n(n-1)-t(G)}$‎, ‎where ${mathcal M}(G)$‎ ‎is the Schur multiplier of $G$ and $t(G)$ is a nonnegative integer‎. ‎The classification of such groups $G$ is already known for $t(G)leq‎ ‎6$‎. ‎This paper extends the classification to $t(G)=7$.

متن کامل

THE STRUCTURE OF FINITE ABELIAN p-GROUPS BY THE ORDER OF THEIR SCHUR MULTIPLIERS

A well-known result of Green [4] shows for any finite p-group G of order p^n, there is an integer t(G) , say corank(G), such that |M(G)|=p^(1/2n(n-1)-t(G)) . Classifying all finite p-groups in terms of their corank, is still an open problem. In this paper we classify all finite abelian p-groups by their coranks.  

متن کامل

Growth in Finite Simple Groups of Lie Type

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A| where ε depends only on the Lie rank of L, or AAA = L. This implies that for a family of simple groups L of Lie type of bounded rank the diameter of any Cayley graph is polylogarithmic in |L|. Combining our result on growth with known results of Bourgain, Gamburd and Va...

متن کامل

Expansion in finite simple groups of Lie type

The beautiful book of Terry Tao starts with the following words: Expander graphs are a remarkable type of graph (or more precisely, a family of graphs) on finite sets of vertices that manage to simultaneously be both sparse (low-degree) and “highly connected” at the same time. They enjoy very strong mixing properties: if one starts at a fixed vertex of an (two-sided) expander graph and randomly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1973

ISSN: 0002-9947

DOI: 10.2307/1996474